The shortest common supersequence problem over binary alphabet is NP-complete
نویسندگان
چکیده
منابع مشابه
The Shortest Common Ordered Supersequence Problem
In this paper, we consider the problem of the shortest common ordered supersequence. In particular, we consider an explicit reduction from the problem to the satisfiability problem.
متن کاملThe Shortest Common Parameterized Supersequence Problem
In this paper, we consider the problem of the shortest common parameterized supersequence. In particular, we consider an explicit reduction from the problem to the satisfiability problem.
متن کاملOn the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
We show that the Fixed Alphabet Shortest Common Supersequence (SCS) and the Fixed Alphabet Longest Common Subsequence (LCS) problems parameterized in the number of strings are W [1]-hard. Unless W [1] = FPT , this rules out the existence of algorithms with time complexity of O(f(k)n) for those problems. Here n is the size of the problem instance, α is constant, k is the number of strings and f ...
متن کاملThe shortest common supersequence problem in a microarray production setting
MOTIVATION During microarray production, several thousands of oligonucleotides (short DNA sequences) are synthesized in parallel, one nucleotide at a time. We are interested in finding the shortest possible nucleotide deposition sequence to synthesize all oligos in order to reduce production time and increase oligo quality. Thus we study the shortest common super-sequence problem of several tho...
متن کاملSolving Shortest Common Supersequence Problem Using Artificial Bee Colony Algorithm
The idea behind this work is to solve the Shortest Common Supersequence by using Artificial Bee Colony (ABC) Algorithm. This algorithm is considered as one of the newest nature-inspired swarm-based optimization algorithms and has a promising performance [6]. Shortest Common Supersequence is a classical problem in the field of strings and it is classified as NP-Hard problem [12]. Many algorithms...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1981
ISSN: 0304-3975
DOI: 10.1016/0304-3975(81)90075-x